Fault-tolerant cycle-embedding in alternating group graphs

نویسندگان

  • Jou-Ming Chang
  • Jinn-Shyong Yang
چکیده

a r t i c l e i n f o a b s t r a c t In a recently published paper [Z.-J. Xue, S.-Y. Liu, An optimal result on fault-tolerant cycle-embedding in alternating group graphs, Inform. the authors showed that for a set of faulty vertices F in an n-dimensional alternating group graph AG n , AG n − F remains pancyclic if |F | 2n − 6. However, the proof of the result is flawed. We will prove the theorem again correcting the defects in the previous proof.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...

متن کامل

Panpositionable hamiltonicity of the alternating group graphs

The alternating group graph AGn is an interconnection network topology based on the Cayley graph of the alternating group. There are some interesting results concerning the hamiltonicity and the fault tolerant hamiltonicity of the alternating group graphs. In this article, we propose a new concept called panpositionable hamiltonicity. A hamiltonian graph G is panpositionable if for any two diff...

متن کامل

Fault-free Hamiltonian Cycles in Alternating Group Graphs with Conditional Edge Faults

The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...

متن کامل

Embedding Hamiltonian cycles in alternating group graphs under conditional fault model

Article history: Received 29 December 2007 Received in revised form 5 May 2008 Accepted 26 October 2008

متن کامل

Edge-bipancyclicity of star graphs under edge-fault tolerant

The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 197  شماره 

صفحات  -

تاریخ انتشار 2008